How to Use Cloud SQL to Create and Manage Relational Databases
Data is everywhere, and managing data is a challenge. Most web websites and applications, businesses, and organizations use databases to store their data. while everything is moving online in a rapid manner managing databases becomes a challenge for organizations. Google Cloud Platform solves all major Relational database problems by introducing their Cloud SQL. Cloud SQL supports all major RDBMS and provides migration from offline databases. In this article, we will learn how businesses can use Cloud SQL to create databases and manage Relational Databases and use their most of time on business logic rather than investing in managing Databases....
read more
Detect cycle in Directed Graph using Topological Sort
Given a Directed Graph consisting of N vertices and M edges and a set of Edges[][], the task is to check whether the graph contains a cycle or not using Topological sort....
read more
Count all Hamiltonian paths in a given directed graph
Given a directed graph of N vertices valued from 0 to N – 1 and array graph[] of size K represents the Adjacency List of the given graph, the task is to count all Hamiltonian Paths in it which start at the 0th vertex and end at the (N – 1)th vertex....
read more
Finding Astronauts from different countries
Given a positive integer N denoting the number of astronauts(labelled from 0 from (N – 1))and a matrix mat[][] containing the pairs of astronauts that are from the same country, the task is to count the number of ways to choose two astronauts from different countries....
read more
Find a string of minimum length containing exactly N occurrences of AB Subsequences
Given an integer N. The task is to print a minimum possible length string such that there must be exactly N occurrences of “AB” subsequences....
read more
Print the lexicographically smallest BFS of the graph starting from 1
Given a connected graph with N vertices and M edges. The task is to print the lexicographically smallest BFS traversal of the graph starting from 1. Note: The vertices are numbered from 1 to N.Examples:...
read more
Power Factor Improvement
Power factor improvement is an indispensable piece of optimizing electrical systems for expanding effectiveness and diminished energy utilization. In the space of electrical designing, power factor is the extent of how effectively electrical power is changed over into important work output. The power factor has a worth somewhere in the range of 0 and 1, with a worth of 1 addressing ideal effectiveness. In numerous modern and business settings, power factors will in general go amiss from solidarity as a result of the presence of responsive power parts, prompting diminished system productivity....
read more
Calculate number of nodes between two vertices in an acyclic Graph by DFS method
Given a connected acyclic graph consisting of V vertices and E edges, a source vertex src, and a destination vertex dest, the task is to count the number of vertices between the given source and destination vertex in the graph....
read more
Rational Numbers: Definition, Examples, Worksheet
Rational Numbers are numbers written in terms of the ratio of two integers, where the denominator is not zero. In maths, Rational numbers are a type of real numbers that can be written in the form of p/q, where q ≠ 0. Any fraction is a rational number provided its denominator should not be zero....
read more
Minimum time taken by each job to be completed given by a Directed Acyclic Graph
Examples:...
read more
Find number of closed islands in given Matrix
Given a binary matrix mat[][] of dimensions NxM such that 1 denotes the island and 0 denotes the water. The task is to find the number of closed islands in the given matrix....
read more
Minimum Cost Path in a directed graph via given set of intermediate nodes
Given a weighted, directed graph G, an array V[] consisting of vertices, the task is to find the Minimum Cost Path passing through all the vertices of the set V, from a given source S to a destination D....
read more